منابع مشابه
Climbing on Pyramids
A new approach is proposed for finding the ”best cut” in a hierarchy of partitions by energy minimization. Said energy must be ”climbing” i.e. it must be hierarchically and scale increasing. It encompasses separable energies and those composed under supremum.
متن کاملThe PYRAMIDS Block Cipher
The “PYRAMIDS” Block Cipher is a symmetric encryption algorithm of a 64, 128, 256-bit plaintext block, that accepts a variable key length of 128, 192, 256 bits. The algorithm is an iterated cipher consisting of repeated applications of simple round transformations with different operations and different sequences in each round.
متن کاملCentered pyramids
Quadtree-like pyramids have the advantage of re-suiting in a multiresolution representation where each pyramid node has four unambiguous parents. Such a centered topology guarantees a clearly defined up-projection of labels. This concept has been successfully and extensively used in applications of contour detection, object recognition and segmentation. Unfortunately, the quadtree-like type of ...
متن کاملLeveraging Pyramids
The Pyramid system associates importance ratings with individual sentences in evaluated summaries. Given that many summarization systems compose their output from source document sentences with limited or no editing, it is often possible to propagate Pyramid ratings back to the source document and tag source sentences with one measure of their suitability to a generic summary. In the case of Py...
متن کاملFraming pyramids
In 1983, Burt and Adelson introduced the Laplacian pyramid (LP) as a multiresolution representation for images. We study the LP using the frame theory, and this reveals that the usual reconstruction is suboptimal. We show that the LP with orthogonal filters is a tight frame, and thus, the optimal linear reconstruction using the dual frame operator has a simple structure that is symmetric with t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SAGE Open
سال: 2013
ISSN: 2158-2440,2158-2440
DOI: 10.1177/2158244013500283